Computing connection strength in probabilistic graphs
نویسندگان
چکیده
3 Probabilistic model for computing connection strength 5 3.1 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.2 Independent edge existence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2.1 General formulae . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.2.2 Computing path connection strength in practice . . . . . . . . . . . . . . . . . . . . 9 3.3 Dependent edge existence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.3.1 Choice nodes on the path . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.3.2 Options of the same choice node on the path . . . . . . . . . . . . . . . . . . . . . . 10
منابع مشابه
Online Appendix to Domain-Independent Data Cleaning via Analysis of Entity-Relationship Graph
Notation. We will compute probabilities of certain events. Notation P(A) refers to the probability of event A to occur. We use E to denote event “E exists” for an edge E. Similarly, we use E 6∃ for event “E does not exist”. Therefore, P(E) refers to the probability that E exists. We will consider situations where the algorithm computes the probability of following (or, ‘going along’) a specific...
متن کاملComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملCorrespondence between probabilistic norms and fuzzy norms
In this paper, the connection between Menger probabilistic norms and H"{o}hle probabilistic norms is discussed. In addition, the correspondence between probabilistic norms and Wu-Fang fuzzy (semi-) norms is established. It is shown that a probabilistic norm (with triangular norm $min$) can generate a Wu-Fang fuzzy semi-norm and conversely, a Wu-Fang fuzzy norm can generate a probabilistic norm.
متن کاملComputing PI and Hyper–Wiener Indices of Corona Product of some Graphs
Let G and H be two graphs. The corona product G o H is obtained by taking one copy of G and |V(G)| copies of H; and by joining each vertex of the i-th copy of H to the i-th vertex of G, i = 1, 2, …, |V(G)|. In this paper, we compute PI and hyper–Wiener indices of the corona product of graphs.
متن کامل